0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n140.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:17:25 CST 2018
0.00/0.20	% done 12 iterations in 0.005s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(complementSubsetComplementIntersect, axiom,
0.00/0.20	  (complementSubsetComplementIntersect <=>
0.00/0.20	   (![A,X]:
0.00/0.20	      (in(X,powerset(A)) =>
0.00/0.20	       (![Y]:
0.00/0.20	          (in(Y,powerset(A)) =>
0.00/0.20	           subset(setminus(A,X),setminus(A,binintersect(X,Y))))))))).
0.00/0.20	tff('0', plain,
0.00/0.20	    ![X2, X3, X4]:
0.00/0.20	      (~ in(X2, powerset(X3))
0.00/0.20	       | subset(setminus(X3, X2), setminus(X3, binintersect(X2, X4)))
0.00/0.20	       | ~ in(X4, powerset(X3))
0.00/0.20	       | ~ complementSubsetComplementIntersect),
0.00/0.20	    inference('cnf', [status(esa)], [complementSubsetComplementIntersect])).
0.00/0.20	tff(complementInPowersetComplementIntersect, conjecture,
0.00/0.20	  (powersetI1 =>
0.00/0.20	   (complementSubsetComplementIntersect =>
0.00/0.20	    (![A,X]:
0.00/0.20	       (in(X,powerset(A)) =>
0.00/0.20	        (![Y]:
0.00/0.20	           (in(Y,powerset(A)) =>
0.00/0.20	            in(setminus(A,X),powerset(setminus(A,binintersect(X,Y))))))))))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (powersetI1 =>
0.00/0.20	     (complementSubsetComplementIntersect =>
0.00/0.20	      (![A,X]:
0.00/0.20	         (in(X,powerset(A)) =>
0.00/0.20	          (![Y]:
0.00/0.20	             (in(Y,powerset(A)) =>
0.00/0.20	              in(setminus(A,X),powerset(setminus(A,binintersect(X,Y)))))))))))).
0.00/0.20	tff('1', plain, complementSubsetComplementIntersect,
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain,
0.00/0.20	    ![X2, X3, X4]:
0.00/0.20	      (~ in(X2, powerset(X3))
0.00/0.20	       | subset(setminus(X3, X2), setminus(X3, binintersect(X2, X4)))
0.00/0.20	       | ~ in(X4, powerset(X3))
0.00/0.20	       | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.20	tff('3', plain,
0.00/0.20	    ![X2, X3, X4]:
0.00/0.20	      (~ in(X4, powerset(X3))
0.00/0.20	       | subset(setminus(X3, X2), setminus(X3, binintersect(X2, X4)))
0.00/0.20	       | ~ in(X2, powerset(X3))),
0.00/0.20	    inference('simplify', [status(thm)], ['2'])).
0.00/0.20	tff(powersetI1, axiom,
0.00/0.20	  (powersetI1 <=> (![A,B]: (subset(B,A) => in(B,powerset(A)))))).
0.00/0.20	tff('4', plain,
0.00/0.20	    ![X0, X1]: (~ subset(X0, X1) | in(X0, powerset(X1)) | ~ powersetI1),
0.00/0.20	    inference('cnf', [status(esa)], [powersetI1])).
0.00/0.20	tff('5', plain, powersetI1, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('6', plain,
0.00/0.20	    ![X0, X1]: (~ subset(X0, X1) | in(X0, powerset(X1)) | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.20	tff('7', plain, ![X0, X1]: (in(X0, powerset(X1)) | ~ subset(X0, X1)),
0.00/0.20	    inference('simplify', [status(thm)], ['6'])).
0.00/0.20	tff('8', plain,
0.00/0.20	    ~ in(setminus(sk_A2, sk_X1), 
0.00/0.20	        powerset(setminus(sk_A2, binintersect(sk_X1, sk_Y1)))),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('9', plain,
0.00/0.20	    (~ $true
0.00/0.20	     | ~ subset(setminus(sk_A2, sk_X1), 
0.00/0.20	           setminus(sk_A2, binintersect(sk_X1, sk_Y1)))),
0.00/0.20	    inference('sup-', [status(thm)], ['7', '8'])).
0.00/0.20	tff('10', plain,
0.00/0.20	    ~ subset(setminus(sk_A2, sk_X1), 
0.00/0.20	        setminus(sk_A2, binintersect(sk_X1, sk_Y1))),
0.00/0.20	    inference('simplify', [status(thm)], ['9'])).
0.00/0.20	tff('11', plain,
0.00/0.20	    (~ $true | ~ in(sk_X1, powerset(sk_A2)) | ~ in(sk_Y1, powerset(sk_A2))),
0.00/0.20	    inference('sup-', [status(thm)], ['3', '10'])).
0.00/0.20	tff('12', plain, in(sk_X1, powerset(sk_A2)),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('13', plain, in(sk_Y1, powerset(sk_A2)),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('14', plain, (~ $true | ~ $true | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['11', '12', '13'])).
0.00/0.20	tff('15', plain, $false, inference('simplify', [status(thm)], ['14'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
